Exact Sojourn Time Distribution in an Online IPTV Recording System
نویسندگان
چکیده
In this paper we analytically derive the sojourn time of a user accessing an online IPTV recording service. Basically, the system consists of a server (or server farm) and the bandwidth at which a user can download recorded files depends on the number of other concurrently downloading users. In particular, we consider both cases, one in which the user’s download speed is limited by his own access bandwidth, whereas in the other case the server is the bottleneck and all downloading users share the server’s upload capacity. Our model includes user impatience which depends on the actual download speed. A user may abort his download attempt if a threshold duration is exceeded. The file size distribution is obtained by measurements of offered files at an existing server.
منابع مشابه
The Pht/Pht/ Queueing System: Part I—The Single Node
W develop a numerically exact method for evaluating the time-dependent mean, variance, and higherorder moments of the number of entities in a Pht/Pht/ queueing system. We also develop a numerically exact method for evaluating the distribution function and moments of the virtual sojourn time for any time t; in our setting, the virtual sojourn time is equivalent to the service time for virtual en...
متن کاملQueueing System: Part II—The Multiclass Network
W demonstrate a numerically exact method for evaluating the time-dependent mean, variance, and higherorder moments of the number of entities in the multiclass Pht/Pht/ K queueing network system, as well as at the individual network nodes. We allow for multiple, independent, time-dependent entity classes and develop time-dependent performance measures by entity class at the nodal and network lev...
متن کاملOn sojourn times in the finite capacity M/M/1 queue with processor sharing
We consider a processor shared M/M/1 queue that can accommodate at most a finite number K of customers. We give an exact expression for the sojourn time distribution in the finite capacity model, in terms of a Laplace transform. We then give the tail behavior, for the limit K → ∞, by locating the dominant singularity of the Laplace transform. keywords: finite capacity, processor sharing, sojour...
متن کاملAnalysis of an M/M/1+G queue operated under the FCFS policy with exact admission control
In this paper, we present an exact theoretical analysis of an M/M/1 system, with arbitrary distribution of relative deadline till the end of service, operated under the first come first served scheduling policy with exact admission control. We provide an explicit solution to the functional equation that must be satisfied by the workload distribution, when the system reaches steady state. We use...
متن کاملThe moments of stochastic integrals and the distribution of sojourn times.
For a single diallelic locus in a finite population with any time-independent selection scheme, using the diffusion approximation, a formula is derived in terms of sojourn times for the moments of the integral of an arbitrary function of gene frequency along sample paths. Irreversible mutation and conditioned and unconditioned processes without mutation are treated. From this expression, the di...
متن کامل